Exploiting non-constant safe memory in resilient algorithms and data structures
نویسندگان
چکیده
منابع مشابه
Exploiting non-constant safe memory in resilient algorithms and data structures
We extend the Faulty RAM model by Italiano and Finocchi (2008) by adding a safe memory of arbitrary size S, and we then derive tradeoffs between the performance of resilient algorithmic techniques and the size of the safe memory. In particular, we describe a resilient algorithm for sorting n entries in O (n logn+ α(δ/S + logS)) time using Θ (S) safe memory locations, where α ≤ δ denotes the act...
متن کاملAlgorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer’s internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. In this work we survey the state of the art in the design and analysis of algorithms and data structures for external memory ...
متن کاملAlgorithms and data structures for in-memory text search engines
In the current information era, everyone has instant access to huge amounts of textual data. Unfortunately, the information is often unstructured and difficult to handle. So the use of search engines is indispensable. Different aspects of search engines are well-established but still active areas of research. Across the relevant literature, inverted index data structures have been proved to be ...
متن کاملData Structures and Algorithms
The classic text, but it lacks topics in network flows and linear programming, as well as more recent algorithms. Revised and more elementary version of the first six chapters of The Design and Analysis of Computer Algorithms. Good examples and problems. Focus on methods rather than specific problems. Reference book devoted to NP-completeness. The second half contains an extensive list of NP-co...
متن کاملData Structures and Algorithms
In this article we provide an introduction to data structures and algorithms. We consider some basic data structures and deal with implementations of a dictionary and a priority queue. Algorithms for such basic problems as matrix multiplication, binary search, sorting, and selection are given. The concepts of randomized computing and parallel computing are also visited.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.04.003